Relational Belief Revision, Broccoli Logic and Minimal Conditional Logic
نویسنده
چکیده
A. We present a generalization of Segerberg’s onion semantics for belief revision, in which the linearity of the spheres need not occur. The resulting logic is called broccoli logic. We provide a minimal relational logic, introducing a new neighborhood semantics operator. We then show that broccoli logic is a well-known conditional logic, the Burgess-Veltman minimal conditional logic.
منابع مشابه
From Onions to Broccoli: Generalizing Lewis’s counterfactual logic
We present a generalization of Segerberg’s onion semantics for belief revision, in which the linearity of the spheres need not occur. The resulting logic is called broccoli logic. We provide a minimal relational logic, introducing a new neighborhood semantics operator. We then show that broccoli logic is a well-known conditional logic, the Burgess-Veltman minimal conditional logic. Belief revis...
متن کاملFrom onions to broccoli: generalizing Lewis' counterfactual logic
We present a generalization of Segerberg’s onion semantics for belief revision, in which the linearity of the spheres need not occur. The resulting logic is called broccoli logic. We provide a minimal relational logic, introducing a new neighborhood semantics operator. We then show that broccoli logic is a well-known conditional logic, the Burgess-Veltman minimal conditional logic. Belief revis...
متن کاملIterated revision and minimal change of conditional beliefs
We describe a model of iterated belief revision that extends the AGM theory of revision to account for the effect of a revision on the conditional beliefs of an agent. In particular, this model ensures that an agent makes as few changes as possible to the conditional component of its belief set. Adopting the Ramsey test, minimal conditional revision provides acceptance conditions for arbitrary ...
متن کاملBelief Revision, Conditional Logic and Nonmonotonic Reasoning
We consider the connections between belief revision, conditional logic and nonmonotonic reasoning, using as a foundation the approach to theory change developed by Alchourrón, Gärdenfors and Makinson (the AGM approach). This is first generalized to allow the iteration of theory change operations to capture the dynamics of epistemic states according to a principle of minimal change of entrenchme...
متن کاملCoalgebraic semantics for logic programs
General logic programs with negation have the 3-valued minimal Herbrand models based on the Kripke’s fixpoint knowledge revision operator and on Clark’s completion. Based on these results we deifine a new algebra , (with the relational algebra embedded in it), and present an algorithmic transformation of logic programs into the system of tuple-variable equations which is a -coalgebra. The solut...
متن کامل